Multivalued distance maps for motion planning on surfaces with moving obstacles

نویسندگان

  • Ron Kimmel
  • Nahum Kiryati
  • Alfred M. Bruckstein
چکیده

This paper presents a new algorithm for planning the time-optimal motion of a robot traveling with limited velocity from a given location to a given destination on a surface in the presence of moving obstacles. Additional constraints such as space variant terrain traversability and fuel economy can be accommodated. A multivalued distance map is defined and applied in computing optimal trajectories. The multivalued distance map incorporates constraints imposed by the moving obstacles, surface topography, and terrain traversability. It is generated by an efficient numerical curve propagation technique.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Centralized Path Planning for Multi-aircraft in the Presence of Static and Moving Obstacles

This article proposes a new approach for centralized path planning of multiple aircraft in presence of the obstacle-laden environment under low flying rules. The problem considers as a unified nonlinear constraint optimization problem. The minimum time and control investigate as the cost functions and the maximum velocity and power consider as the constraints. The pseudospectral method applies ...

متن کامل

Car-like Robots and Moving Obstacles Car-like Robots and Moving Obstacles

| This paper addresses motion planning for a car-like robot moving in a changing planar workspace, i.e. with moving obstacles. First, this motion planning problem is formulated in the state-time space framework. The state-time space of a robot is its state space plus the time dimension. In this framework part of the constraints at hand are translated into static forbidden regions of state-time ...

متن کامل

Incremental Updates of Configuration Space Representations for Non-Circular Mobile Robots with 2D 2.5D or 3D Obstacle Models

This paper presents techniques to incrementally update collision maps, distance maps, and Voronoi diagrams in the configuration space of non-circular mobile robots. Compared to previous work, our approach only updates the cells affected by changes in the environment. Thus, it is applicable in large workspaces and in the presence of unknown or moving obstacles. The c-space collision maps allow f...

متن کامل

Planning High-quality Paths and Corridors Amidst Obstacles

The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design. In this paper we study the problem of planning high-quality paths. A high-quality path should have some desirable properties: it should be short and avoid long detours, and at the same time it should stay at a safe di...

متن کامل

Randomized Motion Planning for Groups of Nonholonomic Robots

This paper presents a technique for motion planning which is capable of planning trajectories for a large number of nonholonomic robots. The robots plan within a two dimensional environment that consists of stationary/moving obstacles, and fixed boundaries. Each robot uses randomized motion planner techniques based on Probabilistic Road Maps (PRM’s) to construct it’s own trajectory that is free...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Robotics and Automation

دوره 14  شماره 

صفحات  -

تاریخ انتشار 1998